separable programming
英 [ˈsepərəbl ˈprəʊɡræmɪŋ]
美 [ˈsepərəbl ˈproʊɡræmɪŋ]
网络 可分离程式设计; 可分规划; 可分离规划
双语例句
- Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.
该参数优化算法可在对偶松弛凸可分规划算法的主循环之外，通过少量参数化扩展得到。 - Dual Gradient Method for Linearly Constrained Strictly Convex Separable Mathematical Programming Problems
线性约束严凸可分规划的对偶梯度法 - In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。 - Based on the property of this model, Separable Programming ( SP) can be used to determine the optimum capacities and layout of the projects.
根据模型性质，采用可分规划法进行求解，从而确定各项工程的最优规模与布局。 - The multiple location optimal model is solved by the method which is called location, distribution by turns. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years.
近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。 - In order to overcome these limitations, the generalized separable plane is introduced based on the definition of MTD and a new algorithm of the MTD problem using nonlinear programming is presented in the paper.
为此，从最小平移距离定义出发，引入广义分离平面概念，提出一种用非线性规划求解距离问题的新算法。 - The master problem that is obtained from the partitioning is a 0-1 integer programming, and the subproblem is a separable nonlinear programming in time and space.
分解后的主问题为0-1规划问题，子问题为时空可解耦的可分非线性规划。 - The primal objective function is strongly convex in [ 1] and [ 2]. In this paper, a new dual gradient method is given to solve linearly constrained, strictly convex, separable mathematical programming problems.
在[1]及[2]中考虑了原目标函数是强凸的情形，本文考虑更一般的情形，即原目标函数是严凸的，给出了其求解的对偶梯度法；